Complexity theory

Results: 3600



#Item
171Computational complexity theory / Complexity classes / Theory of computation / FO / PSPACE / SO / P / EXPTIME / Boolean algebra / Co-NP-complete / Reduction / Descriptive complexity theory

Introduction & Motivation Relations and Operations Boolean and 3-element cases

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-08-14 00:50:42
172Graph theory / Mathematics / Discrete mathematics / AanderaaKarpRosenberg conjecture / Planar graph / Graph property / Graph / Logic of graphs / Triangle-free graph

Decision Tree Complexity, Solvable Groups, and the Distribution of Prime Numbers Joint Work 2010 L´

Add to Reading List

Source URL: files.vipulnaik.com

Language: English - Date: 2016-08-13 11:33:29
173Cryptography / Theoretical computer science / Computational complexity theory / Theory of computation / Pseudorandomness / Random number generation / Randomness / Randomness extractor / Pseudorandom generator / Extractor / Advice / List decoding

Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2004-12-08 14:14:59
174Logic / Mathematical logic / Mathematics / Automated theorem proving / Model theory / Proof theory / Complexity classes / Logical connectives / NP / IP / Negation / Coq

Falso: a simple, self-consistent logic Antoine Amarilli Club Inutile & Estatis, Inc. Scholarly Outreach Division 1 Accounting Dr., Mariana Trench, Intl. Waters

Add to Reading List

Source URL: www.ben-sherman.net

Language: English - Date: 2016-08-02 11:41:55
175Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Combinatorial optimization / NP-hard problems / Approximation algorithms / Edsger W. Dijkstra / Travelling salesman problem / Nearest neighbour algorithm / Shortest path problem / Maximal independent set

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:12
176Computational complexity theory / Mathematics / Graph theory / Analysis of algorithms / Online algorithms / Edsger W. Dijkstra / Network theory / Probabilistic complexity theory / Randomized algorithm / Algorithm / Distributed computing / Shortest path problem

Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:00
177Mathematics / Computational complexity theory / Graph theory / Analysis of algorithms / NP-complete problems / Probabilistic complexity theory / Combinatorics / Randomized algorithm / Rejection sampling / NP / Independent set / Poisson distribution

Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:52
178Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Approximation algorithms / Combinatorial optimization / Set cover problem / Linear programming relaxation / Greedy algorithm / Facility location problem / Reduction

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Add to Reading List

Source URL: users.eecs.northwestern.edu

Language: English - Date: 2009-09-15 22:21:32
179Theoretical computer science / PP / Quantum complexity theory / Boolean algebra / Mathematics / Numerical software / Logic in computer science / Bayesian network / PROPT

Probabilistic Inference and Accuracy Guarantees Stefano Ermon CS Department, Stanford

Add to Reading List

Source URL: intelligence.org

Language: English - Date: 2016-06-01 20:00:33
180Cryptography / Cryptographic hash functions / Information theory / Secure multi-party computation / Transmission Control Protocol / Bandwidth / SHA-1 / Internet protocol suite / Computational complexity theory / Network performance

Forecasting Run-Times of Secure Two-Party Computation Axel Schr¨opfer Florian Kerschbaum

Add to Reading List

Source URL: www.fkerschbaum.org

Language: English - Date: 2011-09-10 05:30:51
UPDATE